Decomposition of infinite eulerian graphs with a small number of vertices of infinite degree
نویسنده
چکیده
We consider the question whether an infinite eulerian graph has a decomposition into circuits and rays if the graph has only finitely many, say n, vertices of infinite degree, and only finitely many finite components after the removal of the vertices of infinite degree. It is known that the answer is affirmative for n < 2 and negative for n > 4. We settle the remaining case n = 3, showing that a decomposition into circuits and rays also exists in this case.
منابع مشابه
Decompositions of infinite graphs: Part II circuit decompositions
We characterize the graphs that admit a decomposition into circuits, i.e. finite or infinite connected 2-regular graphs. Moreover, we show that, as is the case for the removal of a closed eulerian subgraph from a finite graph, removal of a non-dominated eulerian subgraph from a (finite or infinite) graph does not change its circuit-decomposability or circuit-indecomposability. For cycle-decompo...
متن کاملEccentric Connectivity Index of Some Dendrimer Graphs
The eccentricity connectivity index of a molecular graph G is defined as (G) = aV(G) deg(a)ε(a), where ε(a) is defined as the length of a maximal path connecting a to other vertices of G and deg(a) is degree of vertex a. Here, we compute this topological index for some infinite classes of dendrimer graphs.
متن کاملOn reverse degree distance of unicyclic graphs
The reverse degree distance of a connected graph $G$ is defined in discrete mathematical chemistry as [ r (G)=2(n-1)md-sum_{uin V(G)}d_G(u)D_G(u), ] where $n$, $m$ and $d$ are the number of vertices, the number of edges and the diameter of $G$, respectively, $d_G(u)$ is the degree of vertex $u$, $D_G(u)$ is the sum of distance between vertex $u$ and all other vertices of $G$, and $V(G)$ is the...
متن کاملEnds and Vertices of Small Degree in Infinite Minimally k-(Edge)-Connected Graphs
Bounds on the minimum degree and on the number of vertices attaining it have been much studied for finite edge-/vertex-minimally kconnected/k-edge-connected graphs. We give an overview of the results known for finite graphs, and show that most of these carry over to infinite graphs if we consider ends of small degree as well as vertices.
متن کاملOn the edge-connectivity of C_4-free graphs
Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 130 شماره
صفحات -
تاریخ انتشار 1994